Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
نویسندگان
چکیده
Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K. The idea consists of approximating from above the indicator function of K with a sequence of polynomials of increasing degree d, so that the integrals of these polynomials generate a convergence sequence of upper bounds on the volume of K. We show that the asymptotic rate of this convergence is at least O(1/ log log d).
منابع مشابه
Convergence rates of moment-sum-of-squares hierarchies for optimal control problems
We study the convergence rate of moment-sum-of-squares hierarchies of semidefinite programs for optimal control problems with polynomial data. It is known that these hierarchies generate polynomial under-approximations to the value function of the optimal control problem and that these under-approximations converge in the L1 norm to the value function as their degree d tends to infinity. We sho...
متن کاملSums of Squares, Moment Matrices and Optimization over Polynomials
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and inequalities, which is NP-hard in general. Hierarchies of semidefinite relaxations have been proposed in the literature, involving positive semidefinite moment matrices and the dual theory of sums of squares of polynomials. We present these hierarchies of approximations and their main...
متن کاملOn the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
Abstract. In recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial optimization problems (POPs) have gained much popularity. At their heart, these hierarchies rely crucially on Positivstellensätze from the late 20th century (e.g., due to Stengle, Putinar, or Schmüdgen) that certify positivity of a polynomial on ...
متن کاملInner Approximations of the Region of Attraction for Polynomial Dynamical Systems
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional relaxations to the infinite-dimensional LP lead to a truncated moment problem in the primal and a polynomial sum-of-squares problem in the dual. ...
متن کاملMoment-sum-of-squares hierarchies for set approximation and optimal control
This thesis uses the idea of lifting (or embedding) a nonlinear controlled dynamical system into an infinite-dimensional space of measures where this system is equivalently described by a linear equation. This equation and problems involving it are subsequently approximated using well-known moment-sum-of-squares hierarchies. First, we address the problems of region of attraction, reachable set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016